distance-based topological indices and double graph
نویسندگان
چکیده
let $g$ be a connected graph, and let $d[g]$ denote the double graph of $g$. in this paper, we first derive closed-form formulas for different distance based topological indices for $d[g]$ in terms of that of $g$. finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topological indices.
منابع مشابه
Distance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملInterrelations of Graph Distance Measures Based on Topological Indices
In this paper, we derive interrelations of graph distance measures by means of inequalities. For this investigation we are using graph distance measures based on topological indices that have not been studied in this context. Specifically, we are using the well-known Wiener index, Randić index, eigenvalue-based quantities and graph entropies. In addition to this analysis, we present results fro...
متن کاملDistance-based topological indices of tensor product of graphs
Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...
متن کاملRelations between Zagreb Coindices and Some Distance–Based Topological Indices∗
For a nontrivial graph G, its first Zagreb coindex is defined as the sum of degree sum over all non-adjacent vertex pairs in G and the second Zagreb coindex is defined as the sum of degree product over all non-adjacent vertex pairs in G. Till now, established results concerning Zagreb coindices are mainly related to composite graphs and extremal values of some special graphs. The existing liter...
متن کاملM-polynomial and degree-based topological indices
Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...
متن کاملDistance-based topological polynomials and indices of friendship graphs
Drugs and chemical compounds are often modeled as graphs in which the each vertex of the graph expresses an atom of molecule and covalent bounds between atoms are represented by the edges between their corresponding vertices. The topological indicators defined over this molecular graph have been shown to be strongly correlated to various chemical properties of the compounds. In this article, by...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
iranian journal of mathematical chemistryجلد ۸، شماره ۱، صفحات ۸۳-۹۱
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023